Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method Root Contention Protocol with Event B
نویسنده
چکیده
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: first-order classical logic and set theory. Verification is done by proof using the event B method and its prover, we also have a way to model-check models. Refinement is used to describe the studied system at different levels of abstraction: first without time to fix the scheduling of events abstracly, and then with more and more time constraints.
منابع مشابه
Time Constraint Patterns for Event B Development
Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; fr...
متن کاملA mechanically proved and incremental development of IEEE 1394
The IEEE 1394 tree identify protocol illustrates the adequacy of the event-driven approach used together with the B Method . This approach provides a complete framework for developing mathematical models of distributed algorithms. A speci c development is made of a series of more and more re ned models. Each model is made of a number of static properties (the invariant), and of a dynamic parts ...
متن کاملApplication of Parametric Model Checking - The Root Contention Protocol
This paper presents an application of formal verification which was carried out using the new implemented version of the LPMC model checker tool [16]. The focus is on the modeling and the automatic verification of a protocol contained in the IEEE 1394 standard, the Root Contention protocol. The Root Contention protocol involves both realtime and randomization. As it will be shown, it is an illu...
متن کاملProbabilistic Termination in B
The B Method [1] does not currently handle probability. We add it in a limited form, concentrating on “almost-certain” properties which hold with probability one; and we address briefly the implied modifications to the programs that support B. The Generalised Substitution Language is extended with a binary operator ⊕ representing “abstract probabilistic choice”, so that the substitution prog1 ⊕...
متن کامل